Quantum Computing and the Jones Polynomial
نویسنده
چکیده
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملEstimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کاملQuantum Algorithms for the Jones Polynomial
This paper gives a generalization of the AJL algorithm for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle for the Jones parameter. We show that the Kauffman-Lomonaco 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm.
متن کاملTopological Quantum Computing and the Jones Polynomial
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form e. This description is given with two objectives in mind. The first is to describe the algorithm in such a way as to make explicit the underlying and inherent control structure. The second is to make this alg...
متن کاملQuantum Knitting
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of ‘knot invariants’, among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of c...
متن کامل